Waiting Times for Success Runs in a Class of Discrete Point Processes
نویسندگان
چکیده
We generalize some results on success runs for Bernoulli trials to discrete Markovian arrival processes (D-MAP). We study the distribution of the length of an arbitrary success run and the waiting time to the occurrence of a success run of a given length. Formulae for the mean, the variance and the geometric asymptote of the waiting times are presented. Numerical examples illustrate how diierent is the behavior of D-MAPs from that of simple Bernoulli trials.
منابع مشابه
بهبود زمان انتظار بیماران مراجعه کننده به اورژانس با استفاده از شبیه‌سازی گسسته پیشامد
Introduction: Many simulation studies have been conducted in the hospitals and first in the emergency departments to increase the productivity. The first issue in the field of service quality and hence the patient right is “waiting time”. The goal of this study was to reduce patients waiting times, emergency service timing, modeling and improving using discrete event simulation. Methods: This...
متن کاملAppointment process of open-heart surgery in Shahid Rajaei Heart Hospital using a discrete event simulation approach
Background: The waiting list is a list of selected patients in the surgical queue. If demand exceeds capacity, the waiting list grows rapidly, which may lead to unacceptable waiting for patients, especially those in need of acute medical care. Patients waiting for heart surgery are placed on the waiting list for surgery, and sometimes the waiting time is longer than patients expect. Reducing th...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملGambling Teams and Waiting times for Patterns in Two-state Markov Chains
Methods using gambling teams and martingales are developed and applied to find formulas for the expected value and the generating function of the waiting time until observes one of the elements of a finite collection of patterns in a sequence which is generated by a two-state Markov chain. (Keywords: Gambling, teams, waiting times, patterns, success runs, failure runs, Markov chains, martingale...
متن کاملبهبود عملکرد بخش اورژانس با بکارگیری شبیه سازی
Background: Emergency department performance can be evaluated in quantitative and qualitative criteria. Some quantitative criteria are considered such as length of stay, patient waiting time, the percentage of patients that treat in a specific time and etc. In this paper the performance of emergency department was evaluated in terms of these criteria. Then four scenarios by using simulations w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007